Exact approaches for the directed network design problem with relays
نویسندگان
چکیده
منابع مشابه
The network design problem with relays
The network design problem with relays (NDPR) is defined on an undirected graph G = (V,E,K), where V = {1, . . . ,n} is a vertex set, E = {(i, j) : i, j 2 V, i < j} is an edge set. The set K = {(o(k),d(k))} is a set of communication pairs (or commodities): o(k) 2 V and d(k) 2 V denote the origin and the destination of the kth commodity, respectively. With each edge (i, j) are associated a cost ...
متن کاملthe algorithm for solving the inverse numerical range problem
برد عددی ماتریس مربعی a را با w(a) نشان داده و به این صورت تعریف می کنیم w(a)={x8ax:x ?s1} ، که در آن s1 گوی واحد است. در سال 2009، راسل کاردن مساله برد عددی معکوس را به این صورت مطرح کرده است : برای نقطه z?w(a)، بردار x?s1 را به گونه ای می یابیم که z=x*ax، در این پایان نامه ، الگوریتمی برای حل مساله برد عددی معکوس ارانه می دهیم.
15 صفحه اولA hybrid descent method for the two-edge disjoint survivable network design problem with relays
In this paper, we study the network design problem with relays considering network survivability. This problem arises in telecommunications and logistic systems. The design problem involves selecting two edge-disjoint paths between source and destination node pairs and determining the location of the relays in the network to minimize the network cost. A constraint is imposed on the distance tha...
متن کاملExact approaches to the single-source network loading problem
This article considers the network design problem that searches for a minimum-cost way of installing capacities on the edges of a network in order to simultaneously route a flow from a given access point to a subset of nodes representing customers with positive demands. We first consider compact and exponential-sized MIP formulations of the problem and provide their theoretical and computationa...
متن کاملExact Approaches for the Travelling Thief Problem
Many evolutionary and constructive heuristic approaches have been introduced in order to solve the Traveling Thief Problem (TTP). However, the accuracy of such approaches is unknown due to their inability to find global optima. In this paper, we propose three exact algorithms and a hybrid approach to the TTP. We compare these with state-of-theart approaches to gather a comprehensive overview on...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Omega
سال: 2020
ISSN: 0305-0483
DOI: 10.1016/j.omega.2018.11.014